A k-Nearest Neighbor Simulator of Pseudo-Bore Hole Logs for Subsurface Characterization
نویسندگان
چکیده
Subsurface characterization is important for investigations of groundwater contamination as well as petroleum extraction potential. Bore holes or drill logs are a common source of localized stratigraphic information. Sampling and interpolation uncertainties complicate the characterization of the subsurface from these data. Geostatistical methods (Kriging based) have been used to map subsurface attributes from such data, and to generate conditional simulations that honor observed strata. These methods often require an a priori discretization of the bore hole data along each vertical section into strata types as well as assumptions as to statistical homogeneity of the underlying random field that generated this discretized data. A method for generating likely realizations of subsurface soils by sampling pseudo-drill logs on to a horizontal grid by bootstrapping (resampling) drill logs is presented here. Entire drill logs are resampled on to the grid locations, thus obviating the need for a prior discretization of the sample space. The bootstrapping algorithm used can be interpreted in terms of a nonhomogeneous Random Field description of the data with the necessary probability distributions estimated implicitly using a nonparametric (k-nearest neighbor) probability density estimate for the sampling distribution of the drill logs (real or pseudo) that lie in a neighborhood of a grid point at which resampling is needed. Example applications to a synthetic and to a real data set are provided. Extensions to incorporate other sources of information, as well as potential applications of the method are discussed.
منابع مشابه
FUZZY K-NEAREST NEIGHBOR METHOD TO CLASSIFY DATA IN A CLOSED AREA
Clustering of objects is an important area of research and application in variety of fields. In this paper we present a good technique for data clustering and application of this Technique for data clustering in a closed area. We compare this method with K-nearest neighbor and K-means.
متن کاملAsymptotic Behaviors of Nearest Neighbor Kernel Density Estimator in Left-truncated Data
Kernel density estimators are the basic tools for density estimation in non-parametric statistics. The k-nearest neighbor kernel estimators represent a special form of kernel density estimators, in which the bandwidth is varied depending on the location of the sample points. In this paper, we initially introduce the k-nearest neighbor kernel density estimator in the random left-truncatio...
متن کاملAn Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification
The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...
متن کاملAn Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification
The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کامل